Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
+2(s1(x), y) -> +2(x, s1(y))

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
+2(s1(x), y) -> +2(x, s1(y))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

+12(s1(x), y) -> +12(x, y)
+12(s1(x), y) -> +12(x, s1(y))

The TRS R consists of the following rules:

+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
+2(s1(x), y) -> +2(x, s1(y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

+12(s1(x), y) -> +12(x, y)
+12(s1(x), y) -> +12(x, s1(y))

The TRS R consists of the following rules:

+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
+2(s1(x), y) -> +2(x, s1(y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


+12(s1(x), y) -> +12(x, y)
+12(s1(x), y) -> +12(x, s1(y))
The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
+12(x1, x2)  =  x1
s1(x1)  =  s1(x1)

Lexicographic Path Order [19].
Precedence:
trivial


The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ QDPOrderProof
        ↳ QDP
          ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
+2(s1(x), y) -> +2(x, s1(y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.